P-stable as an extension of WFS
نویسندگان
چکیده
We summarize the foundations and applications of the new semantics called p-stable and we show that it holds the important property of extending the WFS semantics.
منابع مشابه
Extensions of the WFS Semantics for Logic Programming
WFS and STABLE are the two most well known non monotonic semantics for logic programming. We introduce WFS ext1 and WFS ext2 , which are non monotonic semantics for function free normal programs. The suitable properties of these semantics are that they extend WFS by allowing a weak form of reasoning by cases, are rational and also polynomial-time computable. We also introduce C-WE , an extensio...
متن کاملCanonical Kripke Models and the Intuitionistic Semantics of Logic Programs
Motivated by the problem of extending stable semantics (SS) and well-founded semantics (WFS) while avoiding their drawbacks, we propose a new simple and intuitive semantics for (normal) logic programs, called canonical Kripke model semantics. Our approach is based on formulating stability in an intuitionistic framework which helps us overcome several drawbacks. As a consequence, every normal pr...
متن کاملStrong Negation in Well-Founded and Partial Stable Semantics for Logic Programs
A formalism called partial equilibrium logic (PEL) has recently been proposed as a logical foundation for the well-founded semantics (WFS) of logic programs. In PEL one defines a class of minimal models, called partial equilibrium models, in a non-classical logic, HT . On logic programs partial equilibrium models coincide with Przymusinski’s partial stable (p-stable) models, so that PEL can be ...
متن کاملSemantics of (disjunctive) Logic Programs Based on Partial Evaluation
We present a new and general approach for deening, understanding, and computing logic programming semantics. We consider disjunctive programs for generality, but our results are still interesting if specialized to normal programs. Our framework consists of two parts: (1) a semantical, where semantics are deened in an abstract way as the weakest semantics satisfying certain properties, and (2) a...
متن کاملReducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
It is wellknown that Minker’s semantics GCWA for positive disjunctive programs P is ΠP2 -complete , i.e. to decide if a literal is true in all minimal models of P . This is in contrast to the same entailment problem for semantics of non-disjunctive programs such as STABLE and SUPPORTED (both are co-NP-complete) as well as Msupp P and WFS (that are even polynomial). Recently, the idea of reducin...
متن کامل